|
Sequential dynamical systems (SDSs) are a class of graph dynamical systems. They are discrete dynamical systems which generalize many aspects of for example classical cellular automata, and they provide a framework for studying asynchronous processes over graphs. The analysis of SDSs uses techniques from combinatorics, abstract algebra, graph theory, dynamical systems and probability theory. ==Definition== An SDS is constructed from the following components:
It is convenient to introduce the ''Y''-local maps ''Fi'' constructed from the vertex functions by : The word ''w'' specifies the sequence in which the ''Y''-local maps are composed to derive the sequential dynamical system map ''F'': ''Kn → Kn'' as : If the update sequence is a permutation one frequently speaks of a ''permutation SDS'' to emphasize this point. The ''phase space'' associated to a sequential dynamical system with map ''F'': ''Kn → Kn'' is the finite directed graph with vertex set ''Kn'' and directed edges (''x'', ''F''(''x'')). The structure of the phase space is governed by the properties of the graph ''Y'', the vertex functions (''fi'')''i'', and the update sequence ''w''. A large part of SDS research seeks to infer phase space properties based on the structure of the system constituents. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「sequential dynamical system」の詳細全文を読む スポンサード リンク
|